Collision times in multicolor urn models and sequential graph coloring with applications to discrete logarithms
نویسندگان
چکیده
منابع مشابه
Collision Times in Multicolor Urn Models and Sequential Graph Coloring With Applications to Discrete Logarithms
Consider an urn model where at each step one of q colors is sampled according to some probability distribution and a ball of that color is placed in an urn. The distribution of assigning balls to urns may depend on the color of the ball. Collisions occur when a ball is placed in an urn which already contains a ball of different color. Equivalently, this can be viewed as sequentially coloring a ...
متن کاملMulticolor urn models with reducible replacement matrices
Consider the multicolored urn model where after every draw, balls of the different colors are added to the urn in proportion determined by a given stochastic replacement matrix. We consider some special replacement matrices which are not irreducible. For three and four color urns, we derive the asymptotic behavior of linear combinations of number of balls. In particular, we show that certain li...
متن کاملA non-uniform birthday problem with applications to discrete logarithms
We consider a generalisation of the birthday problem that arises in the analysis of algorithms for certain variants of the discrete logarithm problem in groups. More precisely, we consider sampling coloured balls and placing them in urns, such that the distribution of assigning balls to urns depends on the colour of the ball. We determine the expected number of trials until two balls of differe...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولA Graph Coloring Problem with Applications to Data Compression
We study properties of graph colorings that minimize the quantity of color information with respect to a given probability distribution P on the vertices of the graph. The minimum entropy of any coloring of such a probabilistic graph (G,P ) is the chromatic entropy Hχ(G,P ). Applications of the chromatic entropy are found in data compression with side information at the receiver and digital ima...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2016
ISSN: 1050-5164
DOI: 10.1214/16-aap1176